a multi-criteria vehicle routing problem with soft time windows by simulated annealing

Authors

r tavakkoli-moghaddam

n safaei

m.a shariat

abstract

this paper presents a multi-criteria vehicle routing problem with soft time windows (vrpstw) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. in this case, the fleet is heterogene-ous. the vrpstw consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. it is assumed that this relaxation affects customer satisfaction and penalty is equal to a degree of customer dissatisfaction. the vrp, which is an extension of traveling sales-man problem (tsp), belongs to a class of np-hard problems. thus, it is necessary to use meta-heuristics for solving vrp in large-scale problems. this paper uses a simulated annealing (sa) approach with 1-opt and 2-opt operators for solving the proposed mathematical model. the proposed model is then solved by the lingo software and the associated solutions are compared with the computational results obtained by the sa ap-proach for a number of instance problems. the obtained results are promising and indicating the efficiency of the proposed sa approach.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A multi-criteria vehicle routing problem with soft time windows by simulated annealing

This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogene-ous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation a...

full text

A multi-criteria vehicle routing problem with soft time windows by simulated annealing

This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to minimize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogeneous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation aff...

full text

A goal programming model for vehicle routing problem with backhauls and soft time windows

The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...

full text

solving a stochastic multi-depot multi-objective vehicle routing problem by a simulated annealing

in this paper, a stochastic multi-depot multi-objective vehicle routing problem (vrp) is studied. based on observations in real-world problems, we develop an aspect of the problem, such as stochastic availability of routes. to solve the problem in this situation, a two-objective mathematical model is developed, in which the related objective functions are: (1) minimizing transportation costs an...

full text

Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands

The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...

full text

A Simulated Annealing Algorithm for the Vehicle Routing Problem with Time Windows and Synchronization Constraints

This paper focuses on solving a variant of the vehicle routing problem (VRP) in which a time window is associated with each customer service and some services require simultaneous visits from different vehicles to be accomplished. The problem is therefore called the VRP with time windows and synchronization constraints (VRPTWSyn). We present a simulated annealing algorithm (SA) that incorporate...

full text

My Resources

Save resource for easier access later


Journal title:
journal of industrial engineering, international

ISSN 1735-5702

volume 1

issue 1 2005

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023